Higher-Order Unification Revisited: Complete Sets of Transformations

نویسندگان

  • Wayne Snyder
  • Jean H. Gallier
چکیده

In this paper, we reexamine the problem of general higher-order unification and develop an approach based on the method of transformations on systems of terms which has its roots in Herbrand’s thesis, and which was developed by Martelli and Montanari in the context of first-order unification. This method provides an abstract and mathematically elegant means of analyzing the invariant properties of unification in various settings by providing a clean separation of the logical issues from the specification of procedural information. Our major contribution is three-fold. First, we have extended the HerbrandMartelli-Montanari method of transformations on systems to higher-order unification and pre-unification; second, we have used this formalism to provide a more direct proof of the completeness of a method for higher-order unification than has previously been available; and, finally, we have shown the completeness of the strategy of eager variable elimination. In addition, this analysis provides another justification of the design of Huet’s procedure, and shows how its basic principles work in a more general setting. Finally, it is hoped that this presentation might form a good introduction to higher-order unification for those readers unfamiliar with the field.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complete Sets of Transformations for General E-Unification

This paper is concerned with E-unification in arbitrary equational theories. We extend the method of transformations on systems of terms, developed by Martelli-Montanari for standard unification, to Eunification by giving two sets of transformations, BT and T, which are proved to be sound and complete in the sense that a complete set of E-unifiers for any equational theory E can be enumerated b...

متن کامل

Operads of higher transformations for globular sets and for higher magmas

‎In this article we discuss examples of fractal $omega$-operads‎. ‎Thus we show that there is an $omega$-operadic approach to explain existence of‎ ‎the globular set of globular setsfootnote{Globular sets are also called $omega$-graphs by the French School.}‎, ‎the reflexive globular set of reflexive globular sets‎, ‎the $omega$-magma of $omega$-magmas‎, ‎and also the reflexive $omega$-magma ...

متن کامل

Towards Correctness of Program Transformations Through Unification and Critical Pair Computation

Correctness of program transformations in extended lambda calculi with a contextual semantics is usually based on reasoning about the operational semantics which is a rewrite semantics. A successful approach to proving correctness is the combination of a context lemma with the computation of overlaps between program transformations and the reduction rules, and then of so-called complete sets of...

متن کامل

Nominal Unification Revisited

Nominal unification calculates substitutions that make terms involving binders equal modulo alphaequivalence. Although nominal unification can be seen as equivalent to Miller’s higher-order pattern unification, it has properties, such as the use of first-order terms with names (as opposed to alphaequivalence classes) and that no new names need to be generated during unification, which set it cl...

متن کامل

Unification procedures in automated deduction methods based on matings: A survey

Unification procedures arising in methods for automated theorem proving based on matings are surveyed. We begin by reviewing some fundamentals of automated deduction, including the Skolem form and the SkolemHerbrand-Gödel theorem. Next, the method of matings for first-order languages without equality due to Andrews and Bibel is presented. Standard unification is described in terms of transforma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 8  شماره 

صفحات  -

تاریخ انتشار 1989